Plowing with precedence: A variant of the windy postman problem

In winter, a common problem is to determine the route that a snowplow should take in order to minimize the distance traveled. We propose a variant of this arc routing problem that is motivated by the fact that deadhead travel over streets that have already been plowed is significantly faster than the time it takes to plow the street. This problem differs from most arc routing problems because the cost of traversing a street changes depending on the order of the streets on a route. We develop a method that generates near-optimal solutions to instances as large as 200 nodes.     

An interior point technique for solving bilevel programming problems

This paper deals with bilevel programs with strictly convex lower level problems. We present the theoretical basis of a kind of necessary and sufficient optimality conditions that involve a single-level mathematical program satisfying the linear independence constraint qualification. These conditions are obtained by replacing the inner problem by their optimality conditions and relaxing their inequality constraints. An algorithm for the bilevel program, based on a well known technique for classical smooth constrained optimization, is also studied. The algorithm obtains a solution of this problem with an effort similar to that required by a classical well-behaved nonlinear constrained optimization problem. Several illustrative problems which include linear, quadratic and general nonlinear functions and constraints are solved, and very good results are obtained for all cases.     

A SIMPLIFIED AES ALGORITHM AND ITS LINEAR AND DIFFERENTIAL CRYPTANALYSES

In this paper, we describe a simplified version of the Advanced Encryption Standard algorithm. This version can be used in the classroom for explaining the Advanced Encryption Standard. After presentation of the simplified version, it is easier for students to understand the real version. This simplified version has the advantage that examples can be worked by hand. We also describe attacks on this version using both linear and differential cryptanalysis. These too can be used in the classroom as a way of explaining those kinds of attacks.     

The Statistical Analysis of Experimental Data

A short-cut rule has been devised for dicotomous data and ill-conditioned quantitative data to test for a one-sided difference between two groups. The rule is defined in terms of a critical count (CC) and a critical difference (CD). For a CC of 4, 8, or 12 the .05 rule is CD equal to 4, 5, or 6, respectively, and the .Ol rule is CD equal to 5, 6, or 7, respectively.     

Discovery of an Allosteric Ligand Binding Site in SMYD3 Lysine Methyltransferase

SMYD3 is a multifunctional epigenetic enzyme with lysine methyltransferase activity and various interaction partners. It is implicated in the pathophysiology of cancers but with an unclear mechanism. To discover tool compounds for clarifying its biochemistry and potential as a therapeutic target, a set of drug-like compounds was screened in a biosensor-based competition assay. Diperodon was identified as an allosteric ligand; its R and S enantiomers were isolated, and their affinities to SMYD3 were determined (K_D=42 and 84 μM, respectively). Co-crystallization revealed that both enantiomers bind to a previously unidentified allosteric site in the C-terminal protein binding domain, consistent with its weak inhibitory effect. No competition between diperodon and HSP90 (a known SMYD3 interaction partner) was observed although SMYD3–HSP90 binding was confirmed (K_D=13 μM). Diperodon clearly represents a novel starting point for the design of tool compounds interacting with a druggable allosteric site, suitable for the exploration of noncatalytic SMYD3 functions and therapeutics with new mechanisms of action.